/**
 * Created with IntelliJ IDEA
 * Description:
 * User: Administrator
 * Data: 2023 - 08 - 25
 * Time: 13:30
 */
//牛客 二分查找-I
public class Solution2 {
    public int search (int[] nums, int target) {
        int left = 0;//已经包含了nums.length为0的情况
        int right = nums.length - 1;
        while(left <= right) {
            int mid = (left + right) / 2;
            if(target > nums[mid]) {
                left = mid + 1;
            }else if(target < nums[mid]) {
                right = mid - 1;
            }else {
                return mid;
            }
        }
        return -1;
    }
}
